- starting configuration
- исходная конфигурация
Авиасловарь. М.А.Левин. 2004.
starting configuration
Смотреть что такое "starting configuration" в других словарях:
Configuration (geometry) — Configurations (4362) (a complete quadrangle, at left) and (6243) (a complete quadrilateral, at right). In mathematics, specifically projective geometry, a configuration in the plane consists of a finite set of points, and a finite arrangement of … Wikipedia
Chess960 starting position — Chess960 is a chess variant in which the arrangement of pieces on the first rank is randomly generated. There are 960 possible starting positions, hence the name. The starting position can be generated before the game either by a computer program … Wikipedia
Electron configuration — Electron atomic and molecular orbitals Simp … Wikipedia
Vertex configuration — In polyhedral geometry a vertex configuration is a short hand notation for representing a polyhedron vertex figure as the sequence of faces around a vertex. For uniform polyhedra there is only one vertex type and therefore the vertex… … Wikipedia
Pappus configuration — In projective geometry, the Pappus configuration consists of a pair (( A , B , C ), ( D , E , F )) of triplets of points, which pair is located either on a pair of lines or on two sides of a conic section, with a hexagon AECDBF defined on the… … Wikipedia
Texas hold 'em starting hands — A pair of aces is the best pre flop hand to be dealt in Texas Hold em Poker Texas hold em starting hands consists of two hole cards in the poker game of Texas hold em, which belong solely to the player and remain hidden from the other players.… … Wikipedia
Morpion solitaire — is a one player paper and pencil game. References to the game first appeared in French publications in the 1970s.[1] In addition to being played recreationally, the game has been the subject of theoretical studies[2] and computer searches for… … Wikipedia
Tanbo — is a board game invented by Mark Steere in 1993.It typically uses a 19x19 Go board, but (like Go) it can be played on larger or smaller boards, depending on the intended length and depth of the game. The game has, however, a very big first move… … Wikipedia
Mortality (computability theory) — In computability theory, the mortality problem is a decision problem which can be stated as follows: Given a Turing machine, decide whether it halts when run on any configuration (not necessarily a starting one) In the statement above, the… … Wikipedia
Probabilistic Roadmap Method — The Probabilistic Roadmap (PRM) [L. E. Kavraki, P. Svestka, J.C. Latombe, and M.H. Overmars. Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4):566 580, June 1996 … Wikipedia
Queue machine — A queue machine or queue automaton is a finite state machine with the ability to store and retrieve data from an infinite memory queue. It is a model of computation equivalent to a Turing machine, and therefore it can process any formal language … Wikipedia
